منابع مشابه
Complex network dimension and path counts
Large complex networks occur in many applications of computer science. The complex network zeta function and the graph surface function have been used to characterize these networks and to define a dimension for complex networks. In this work we present three new results related to the complex network dimension. First, we show the relationship of the concept to Kolmogorov complexity. Second, we...
متن کاملTPS DR: A Universal Dimension Reducing Algorithm for Optimal Trust Path Selection in Complex Sensor Network
Energy efficiency, one of the key factors for sensor network, is a challenging work. It is agreed that sink routing is the main influencing factor for energy efficiency and selecting an optimal routing path becomes critical. It is hard for source participant (sink nodes, namely trustor) to select a trustworthy target participant (data collecting sensor nodes, namely trustee), especially when th...
متن کاملdedekind modules and dimension of modules
در این پایان نامه، در ابتدا برای مدول ها روی دامنه های پروفر شرایط معادل به دست آورده ایم و خواصی از ددکیند مدول ها روی دامنه های پروفر مشخص کرده ایم. در ادامه برای ددکیند مدول های با تولید متناهی روی حلقه های به طور صحیح بسته شرایط معادل به دست آورده ایم و ددکیند مدول های ضربی را مشخص کرده ایم. گزاره هایی در مورد بعد ددکیند مدول ها بیان کرده ایم. در پایان، قضایای lying over و going down را برا...
15 صفحه اولVisual Clustering of Complex Network Based on Nonlinear Dimension Reduction
In this paper, we present a new visual clustering algorithm inspired by nonlinear dimension reduction technique: Isomap. The algorithm firstly defines a new graph distance between any two nodes in complex networks and then applies the distance matrix to Isomap and projects all nodes into a two dimensional plane. The experiments prove that the projected nodes emerge clear clustering property whi...
متن کاملVC-Dimension and Shortest Path Algorithms
We explore the relationship between VC-dimension and graph algorithm design. In particular, we show that set systems induced by sets of vertices on shortest paths have VC-dimension at most two. This allows us to use a result from learning theory to improve time bounds on query algorithms for the point-to-point shortest path problem in networks of low highway dimension, such as road networks. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.02.013